COMMENT ⊗   VALID 00002 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	Here's the status of various projects:
C00005 ENDMK
C⊗;
Here's the status of various projects:

	WHILEASSEM
The new Whileasem can handle two examples (when carefully coaxed):
the climbing frame and the factorial frame. Ability to handle other
examples is not guaranteed (or suspected).

	RECURSION RULE
Hand simulation of the Luckham recursion rule for factorial and finite
binary tree frames was done. Modifications to JRB's COMPR to allow input
of such frames was attempted. Attacks by vipers has hampered completion.


	LISP WITH DATA STRUCTURES
A clean extension of LISP giving user-definable data structures was
persued. This should be the final chapter of MS. Material of Reynolds,
Wegbreit, and Gordon was examined here. It is easy to give clean syntactic
handles, but clean semantics seems difficult.

	HAL
With applications of DCL-JRB's APG in mind, the HAL language of the
four R's -Richard, Robert, Ray, and Russell was studied. HAL is in a very
rudimentary state with a public preliminary paper promised within a month.
The basic language is very ad-hoc and unclean.


	LISP MANUSCRIPT
A new section incorporating much of M. Gordon's  thesis was added. This
turned out to be a natural extension of existing text and gives a very nice
intuitive introduction to Scott-Strachey. Papers of Reynolds, Scott and the
thesis of R. Tennent influenced the approach.

A different approach to binding and compilation was introduced.
The scheme is called "deep binding" in contrast to the "shallow binding"
scheme of LISP 1.6.